Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold

نویسندگان

  • Yacine Boufkhad
  • Thomas Hugel
چکیده

Abstract. We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discriminate among neighboring solutions on the basis of uniform information about each individual free variable. What we mean by uniform information, is information which does not depend on the solution: e.g. the number of positive/negative occurrences of the considered variable. What is new in our approach is that we use non uniform information about variables. Thus we are able to make a more precise tuning, resulting in a slight improvement on upper bounding the 3-SAT threshold for various models of formulas defined by their distributions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Second Moment Method on k-SAT: a General Framework

Just as the First Moment Method is a way to upper-bound the threshold of k-SAT, so is the Second Moment Method a way to lower-bound it. After a brief technical introduction to the Second Moment Method in section 1.1, we present in section 1.2 a survey of the early attempts to lower-bound the threshold of 3-SAT through the Second Moment Method. As in the First Moment Method, the general idea is ...

متن کامل

UPPER BOUND ON THE SATISFIABILITY THRESHOLD OF REGULAR RANDOM (k, s)-SAT PROBLEM

We consider a strictly regular random (k, s)-SAT problem and propose a GSRR model for generating its instances. By applying the first moment method and the asymptotic approximation of the γth coefficient for generating function f(z), where λ and γ are growing at a fixed rate, we obtain a new upper bound 2 log 2−(k+1) log 2/2+ εk for this problem, which is below the best current known upper boun...

متن کامل

Phase Transitions and Satisfiability Threshold

The 3-SAT problem consists in determining if a boolean formula with 3 literals per clause is satisfiable. When the ratio between the number of clauses and the number of variables increases, a threshold phenomenon is observed: the probability of satisfiability appears to decrease sharply from 1 to 0 in the neighbourghood of a fixed threshold value, conjectured to be close to 4.25. Although a thr...

متن کامل

Bounds on Threshold of Regular Random k-SAT

We consider the regular model of formula generation in conjunctive normal form (CNF) introduced by Boufkhad et. al. in [6]. In [6], it was shown that the threshold for regular random 2-SAT is equal to unity. Also, upper and lower bound on the threshold for regular random 3-SAT were derived. Using the first moment method, we derive an upper bound on the threshold for regular random k-SAT for any...

متن کامل

Effect of Variable Thermal Conductivity and the Inclined Magnetic Field on MHD Plane Poiseuille Flow in a Porous Channel with Non-Uniform Plate Temperature

The aim of this paper is to investigate the effect of the variable thermal conductivity and the inclined uniform magnetic field on the plane Poiseuille flow of viscous incompressible electrically conducting fluid between two porous plates Joule heating in the presence of a constant pressure gradient through non-uniform plate temperature. It is assumed that the fluid injection occurs at lower pl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010